Complete Exchange in 2D Meshes
نویسندگان
چکیده
We propose a new algorithm called Cyclic Exchange for all-to-all personalized exchange in a 2D mesh. This algorithm fully interleaves communication in both dimensions of a mesh. We have compared by simulation the performance of this algorithm with that of the Quadrant Exchange method previously proposed in the literature 2]. The results show that the new algorithm is faster for a range of machine size, problem size and startup/transmission ratio.
منابع مشابه
Bandwidth-Optimal Complete Exchange on Wormhole-Routed 2D/Torus Networks: A Diagonal-Propagation Approach
All-to-all personalized communication, or complete exchange, is at the heart of numerous applications in parallel computing. Several complete exchange algorithms have been proposed in the literature for wormhole meshes. However, these algorithms, when applied to tori, can not take advantage of wrap-around interconnections to implement complete exchange with reduced latency. In this paper, a new...
متن کاملBandwidth-Optimal Complete Exchange on Wormhole-Routed 2D/3D Torus Networks: A Diagonal-Propagation Approach
All-to-all personalized communication, or complete exchange, is at the heart of numerous applications in parallel computing. Several complete exchange algorithms have been proposed in the literature for wormhole meshes. However, these algorithms, when applied to tori, can not take advantage of wrap-around interconnections to implement complete exchange with reduced latency. In this paper, a new...
متن کاملModified Fixed Grid Finite Element Method in the Analysis of 2D Linear Elastic Problems
In this paper, a modification on the fixed grid finite element method is presented and used in the solution of 2D linear elastic problems. This method uses non-boundary-fitted meshes for the numerical solution of partial differential equations. Special techniques are required to apply boundary conditions on the intersection of domain boundaries and non-boundary-fitted elements. Hence, a new met...
متن کاملA Systematic Approach to Develop Efficient Complete Exchange Algorithms for Meshes and Tori
Many authors have considered the design of complete exchange algorithms for a variety of multicomputer models, including hypercubes, multidimensional meshes and tori with different port and message switching models. Frequently, algorithms for a given multicomputer architecture cannot be used (or are not efficient) for a different architecture. This paper presents a method which allows the syste...
متن کامل3D-2D Deformable Image Registration Using Feature-Based Nonuniform Meshes
By using prior information of planning CT images and feature-based nonuniform meshes, this paper demonstrates that volumetric images can be efficiently registered with a very small portion of 2D projection images of a Cone-Beam Computed Tomography (CBCT) scan. After a density field is computed based on the extracted feature edges from planning CT images, nonuniform tetrahedral meshes will be au...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994